Blockchain Consensus: Performance Modeling
Public Blockchain
Asymptotic Performance Analysis of Blockchain Protocols
Antoine Durand, Elyes Ben-Hamida (IRT SystemX, Paris-Saclay), David Leporini, and G´erard Memmi
Latency and communication complexity (as total message size)
Citing the result from each paper with different assumptions
https://gyazo.com/e30b2b2a536ac75876c878e40585e12f
Prism
TPS analysis of longest-chain, GHOST and Prism (PoW)
See in Parallel consensus
Classical BFT
Performance Modeling of PBFT Consensus Process for Permissioned Blockchain Network (Hyperledger Fabric)
Harish Sukhwani et al.
Model the PBFT consensus process using Stochastic Reward Nets (SRN) to compute the mean time to complete consensus for networks up to 100 peers
Best-Case Complexity of Asynchronous Byzantine Consensus
Partha Dutta, Rachid Guerraoui and Marko Vukoli´c
A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems
Shreya Agrawal, Khuzaima Daudjee (University of Waterloo)
https://gyazo.com/068226a1c656075f90cd1a6c63b3ae07
Performance Analysis of the Raft Consensus Algorithm for Private Blockchains
Dongyan Huang, Xiaoli Ma, Shengli Zhang
Propose a simple but accurate analytical model to analyze the distributed network split probability.
The network split probability as a function of the network size, the packet loss rate, and the election timeout period. To validate our analysis, we implement a Raft
Simulation: the results coincide with the analytical esults